A New Decoding for Polynomial Residue Codes with Non-Pairwise Coprime Moduli
نویسندگان
چکیده
This paper presents a new decoding for polynomial residue codes, called the minimum degree-weighted distance decoding. The newly proposed decoding is based on the degreeweighted distance and different from the traditional minimum Hamming distance decoding. It is shown that for the two types of minimum distance decoders, i.e., the minimum degree-weighted distance decoding and the minimum Hamming distance decoding, one is not absolutely stronger than the other, but they can complement each other from different points of view.
منابع مشابه
Robust Polynomial Reconstruction via Chinese Remainder Theorem in the Presence of Small Degree Residue Errors
Based on unique decoding of the polynomial residue code with non-pairwise coprime moduli, a polynomial with degree less than that of the least common multiple (lcm) of all the moduli can be accurately reconstructed when the number of residue errors is less than half the minimum distance of the code. However, once the number of residue errors is beyond half the minimum distance of the code, the ...
متن کاملTitle A new Decoding Method of Redundant Residue Polynomial Codes
This paper presents a new decoding method of redundant residue polynomial codes. The decoding method has an advantage of correcting errors easily by checking the degree of the product of a polynomial corresponding to a received code and the moduli corresponding to error positions. The number of operations needed fbr this decoding method is about 1/10-11100 tirnes as Iarge as that needed fbr the...
متن کاملOverflow Detection in Residue Number System, Moduli Set {2n-1,2n,2n+1}
Residue Number System (RNS) is a non-weighted number system for integer number arithmetic, which is based on the residues of a number to a certain set of numbers called module set. The main characteristics and advantage of residue number system is reducing carry propagation in calculations. The elimination of carry propagation leads to the possibility of maximizing parallel processing and reduc...
متن کاملFast algorithm for decoding of systematic quadratic residue codes
A general algorithm for decoding the binary systematic quadratic residue (QR) codes with lookup tables is presented in this study. The algorithm can be applied in decoding the QR codes with either reducible or irreducible generator polynomials. If the generator polynomial of the QR codes is reducible, the number of elements in the Galois field is less than the sum of all correctable error patte...
متن کاملAlgebraic Decoding of Two Quadratic Residue Codes Using Unknown Syndrome Representation
This paper addresses the problem of improving the unknown syndrome representations to develop algebraic decoding of the (17,9,5) and (23,12,7) binary quadratic residue codes up to true minimum distance, respectively. The proposed unknown syndrome representations are expressed as binary polynomials in terms of the single known syndrome, which is different from the known syndrome in [Chang-Lee, A...
متن کامل